Rapidly-exploring random tree - PDFSEARCH.IO - Document Search Engine

Rapidly-exploring random tree
Results: 62

#	Item
11	Reachability-Guided Sampling for Planning Under Differential Constraints Alexander Shkolnik, Matthew Walter, and Russ Tedrake Abstract— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning prob Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-11-19 14:27:01 Robot control Artificial intelligence Geometry Discrete geometry Motion planning Voronoi diagram Tree Nonholonomic system Bridge Search algorithms Mathematics Rapidly-exploring random tree
12	Kinodynamic Randomized Rearrangement Planning via Dynamic Transitions Between Statically Stable States Joshua A. Haustein∗ , Jennifer King† , Siddhartha S. Srinivasa† , Tamim Asfour∗ ∗ Karlsruhe Institute of Te Add to Reading List Source URL: www.ri.cmu.edu Language: English - Date: 2015-05-11 12:59:51 Motion planning Theoretical computer science Tmax Rapidly-exploring random tree Robot Kinematics Reactive planning Planner Library Robotics Artificial intelligence Automated planning and scheduling
13	Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-11-19 14:27:00 Search algorithms Motion planning Algorithm Collision detection Computer science Rapidly-exploring random tree Theoretical computer science Applied mathematics Mathematics
14	Adaptive Motion Planning for Humanoid Robots Nikolaus Vahrenkamp∗ , Christian Scheurer∗ , Tamim Asfour∗ , James Kuffner† and R¨udiger Dillmann∗ ∗ Institute of Computer Science and Engineering University of K Add to Reading List Source URL: wwwiaim.ira.uka.de Language: English - Date: 2008-07-07 04:15:57 Physics Mechanical engineering Rapidly-exploring random tree Motion planning Probabilistic roadmap Humanoid robot Inverse kinematics Robot Degrees of freedom Robot kinematics Robot control Artificial intelligence
15	Planning Multi-Robot Grasping Motions Nikolaus Vahrenkamp, Enrico Kuhn, Tamim Asfour and R¨udiger Dillmann Institute for Anthropomatics Karlsruhe Institute of Technology Adenauerring 2, 76131 Karlsruhe, Germany Email: { Add to Reading List Source URL: wwwiaim.ira.uka.de Language: English - Date: 2010-11-15 15:28:59 Inverse problems Motion planning Theoretical computer science Rapidly-exploring random tree Humanoid robot Inverse kinematics Robot Mobile robot ROS Robotics Robot kinematics Robot control
16	Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula Add to Reading List Source URL: www.cse.unr.edu Language: English - Date: 2012-12-20 19:29:35 Robot control Search algorithms Rapidly-exploring random tree Motion planning Algorithm Asymptotic computational complexity Asymptotically optimal algorithm Probabilistic roadmap Shortest path problem Applied mathematics Mathematics Theoretical computer science
17	Batch Informed Trees (BIT): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs arXiv:1405.5848v6 [cs.RO] 26 FebJonathan D. Gammell1 , Siddhartha S. Srinivasa2 Add to Reading List Source URL: www.ri.cmu.edu Language: English* - Date: 2015-05-20 10:11:27 Search algorithms Combinatorial optimization Routing algorithms Rapidly-exploring random tree Robot control Shortest path problem A* search algorithm Graph Connectivity Mathematics Graph theory Theoretical computer science
18	Informed RRT: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic Jonathan D. Gammell1 , Siddhartha S. Srinivasa2 , and Timothy D. Barfoot1 Abstract— Rapidly-explori Add to Reading List Source URL: www.ri.cmu.edu Language: English* - Date: 2014-07-22 11:25:05 Heuristics Artificial intelligence Rapidly-exploring random tree Robot control Combinatorial optimization Routing algorithms Heuristic function A* search algorithm Motion planning Search algorithms Mathematics Applied mathematics
19	Nonprehensile Whole Arm Rearrangement Planning on Physics Manifolds Jennifer E. King⇤ , Joshua A. Haustein† , Siddhartha S. Srinivasa⇤ , Tamim Asfour† ⇤ Carnegie Mellon University (CMU), † Karlsruhe Institute Add to Reading List Source URL: www.ri.cmu.edu Language: English - Date: 2015-05-11 13:02:41 Motion planning Theoretical computer science Probabilistic roadmap Rapidly-exploring random tree Planner Robot Collision detection Causality Robotics Robot control Artificial intelligence
20	Planning for Robust Execution of Humanoid Motions Using Future Perceptive Capability Add to Reading List Source URL: wwwiaim.ira.uka.de Language: English - Date: 2009-08-21 03:36:14 Motion planning Theoretical computer science Humanoid robot Robot Visual Servoing Rapidly-exploring random tree Mobile robot ROS Degrees of freedom Robotics Robot kinematics Robot control